AustralieFrV1, Main, Exploration, bibRecord, 006356

Path-Based Distance with Varying Weights and Neighborhood Sequences

Identifieur interne : 006356 ( Main/Exploration ); précédent : 006355; suivant : 006357

Path-Based Distance with Varying Weights and Neighborhood Sequences

Auteurs : Nicolas Normand [France, Australie] ; Robin Strand [Suède] ; Pierre Evenou [France] ; Aurore Arlicot [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.

RBID : ISTEX:A5F79A9A2C391DEFF2AF8806F2F3DC5B99B0E7B5

English descriptors

Abstract

Abstract: This paper presents a path-based distance where local displacement costs vary both according to the displacement vector and with the travelled distance. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, chamfer distances and generalized distances based on Minkowski sums. We introduce algorithms to compute, in $\mathbb Z^2$ , a translated version of a neighborhood sequence distance map with a limited number of neighbors, both for periodic and aperiodic sequences. A method to recover the centered distance map from the translated one is also introduced. Overall, the distance transform can be computed with minimal delay, without the need to wait for the whole input image before beginning to provide the result image.

Url:

https://api.istex.fr/document/A5F79A9A2C391DEFF2AF8806F2F3DC5B99B0E7B5/fulltext/pdf

DOI: 10.1007/978-3-642-19867-0_17

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 001F49
to stream Istex, to step Curation: 001F49
to stream Istex, to step Checkpoint: 000775
to stream Main, to step Merge: 006732
to stream Main, to step Curation: 006356

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Path-Based Distance with Varying Weights and Neighborhood Sequences</title>
<author><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
</author>
<author><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name>
</author>
<author><name sortKey="Evenou, Pierre" sort="Evenou, Pierre" uniqKey="Evenou P" first="Pierre" last="Evenou">Pierre Evenou</name>
</author>
<author><name sortKey="Arlicot, Aurore" sort="Arlicot, Aurore" uniqKey="Arlicot A" first="Aurore" last="Arlicot">Aurore Arlicot</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:A5F79A9A2C391DEFF2AF8806F2F3DC5B99B0E7B5</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-19867-0_17</idno>
<idno type="url">https://api.istex.fr/document/A5F79A9A2C391DEFF2AF8806F2F3DC5B99B0E7B5/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001F49</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001F49</idno>
<idno type="wicri:Area/Istex/Curation">001F49</idno>
<idno type="wicri:Area/Istex/Checkpoint">000775</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000775</idno>
<idno type="wicri:doubleKey">0302-9743:2011:Normand N:path:based:distance</idno>
<idno type="wicri:Area/Main/Merge">006732</idno>
<idno type="wicri:Area/Main/Curation">006356</idno>
<idno type="wicri:Area/Main/Exploration">006356</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Path-Based Distance with Varying Weights and Neighborhood Sequences</title>
<author><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>IRCCyN UMR CNRS 6597, University of Nantes</wicri:regionArea>
<wicri:noRegion>University of Nantes</wicri:noRegion>
<wicri:noRegion>University of Nantes</wicri:noRegion>
</affiliation>
<affiliation wicri:level="3"><country xml:lang="fr">Australie</country>
<wicri:regionArea>School of Physics, Monash University, Melbourne</wicri:regionArea>
<placeName><settlement type="city">Melbourne</settlement>
<region type="état">Victoria (État)</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name>
<affiliation wicri:level="4"><country xml:lang="fr">Suède</country>
<wicri:regionArea>Centre for Image Analysis, Uppsala University</wicri:regionArea>
<placeName><settlement type="city">Uppsala</settlement>
<region nuts="1">Svealand</region>
<region nuts="1">East Middle Sweden</region>
</placeName>
<orgName type="university">Université d'Uppsala</orgName>
</affiliation>
</author>
<author><name sortKey="Evenou, Pierre" sort="Evenou, Pierre" uniqKey="Evenou P" first="Pierre" last="Evenou">Pierre Evenou</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>IRCCyN UMR CNRS 6597, University of Nantes</wicri:regionArea>
<wicri:noRegion>University of Nantes</wicri:noRegion>
<wicri:noRegion>University of Nantes</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Arlicot, Aurore" sort="Arlicot, Aurore" uniqKey="Arlicot A" first="Aurore" last="Arlicot">Aurore Arlicot</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>IRCCyN UMR CNRS 6597, University of Nantes</wicri:regionArea>
<wicri:noRegion>University of Nantes</wicri:noRegion>
<wicri:noRegion>University of Nantes</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2011</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Beatty sequences</term>
<term>Binary image</term>
<term>Complementary sequences</term>
<term>Discrete distances</term>
<term>Displacement cost</term>
<term>Displacement costs</term>
<term>Displacement vector</term>
<term>Generalized distance</term>
<term>Generalized distance transformation</term>
<term>Generalized distances</term>
<term>Induction hypothesis</term>
<term>Minimal cost</term>
<term>Minimal delay</term>
<term>Minimal displacement costs</term>
<term>Minkowski operations</term>
<term>Minkowski sums</term>
<term>Neighborhood sequences</term>
<term>Neighbourhood sequences</term>
<term>Nite cost</term>
<term>Normand</term>
<term>Null displacement</term>
<term>Null vector</term>
<term>Octagonal distance</term>
<term>Partial cost</term>
<term>Pattern recognition</term>
<term>Periodic sequence</term>
<term>Scan</term>
<term>Scan condition</term>
<term>Scan order</term>
<term>Sequential algorithms</term>
<term>Simple distances</term>
<term>Single scan</term>
<term>Solid lines</term>
<term>Total cost</term>
<term>Translation vectors</term>
<term>Travelled distance</term>
<term>Weighted distance</term>
<term>Weighted distances</term>
</keywords>
<keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term>
<term>Beatty sequences</term>
<term>Binary image</term>
<term>Complementary sequences</term>
<term>Discrete distances</term>
<term>Displacement cost</term>
<term>Displacement costs</term>
<term>Displacement vector</term>
<term>Generalized distance</term>
<term>Generalized distance transformation</term>
<term>Generalized distances</term>
<term>Induction hypothesis</term>
<term>Minimal cost</term>
<term>Minimal delay</term>
<term>Minimal displacement costs</term>
<term>Minkowski operations</term>
<term>Minkowski sums</term>
<term>Neighborhood sequences</term>
<term>Neighbourhood sequences</term>
<term>Nite cost</term>
<term>Normand</term>
<term>Null displacement</term>
<term>Null vector</term>
<term>Octagonal distance</term>
<term>Partial cost</term>
<term>Pattern recognition</term>
<term>Periodic sequence</term>
<term>Scan</term>
<term>Scan condition</term>
<term>Scan order</term>
<term>Sequential algorithms</term>
<term>Simple distances</term>
<term>Single scan</term>
<term>Solid lines</term>
<term>Total cost</term>
<term>Translation vectors</term>
<term>Travelled distance</term>
<term>Weighted distance</term>
<term>Weighted distances</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: This paper presents a path-based distance where local displacement costs vary both according to the displacement vector and with the travelled distance. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, chamfer distances and generalized distances based on Minkowski sums. We introduce algorithms to compute, in $\mathbb Z^2$ , a translated version of a neighborhood sequence distance map with a limited number of neighbors, both for periodic and aperiodic sequences. A method to recover the centered distance map from the translated one is also introduced. Overall, the distance transform can be computed with minimal delay, without the need to wait for the whole input image before beginning to provide the result image.</div>
</front>
</TEI>
<affiliations><list><country><li>Australie</li>
<li>France</li>
<li>Suède</li>
</country>
<region><li>East Middle Sweden</li>
<li>Svealand</li>
<li>Victoria (État)</li>
</region>
<settlement><li>Melbourne</li>
<li>Uppsala</li>
</settlement>
<orgName><li>Université d'Uppsala</li>
</orgName>
</list>
<tree><country name="France"><noRegion><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
</noRegion>
<name sortKey="Arlicot, Aurore" sort="Arlicot, Aurore" uniqKey="Arlicot A" first="Aurore" last="Arlicot">Aurore Arlicot</name>
<name sortKey="Evenou, Pierre" sort="Evenou, Pierre" uniqKey="Evenou P" first="Pierre" last="Evenou">Pierre Evenou</name>
</country>
<country name="Australie"><region name="Victoria (État)"><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
</region>
</country>
<country name="Suède"><region name="Svealand"><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006356 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006356 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:A5F79A9A2C391DEFF2AF8806F2F3DC5B99B0E7B5
   |texte=   Path-Based Distance with Varying Weights and Neighborhood Sequences
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur les relations entre la France et l'Australie

Path-Based Distance with Varying Weights and Neighborhood Sequences

Path-Based Distance with Varying Weights and Neighborhood Sequences

Source :

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri